A Theory of Formal Synthesis via Inductive Learning

Formal synthesis is the process of generating a program satisfying a high-level formal specification. In recent times, effective formal synthesis methods have been proposed based on the use of inductive learning. We refer to this class of methods that learn programs from examples as formal inductive synthesis. In this paper, we present a theoretical framework for formal inductive synthesis. We discuss how formal inductive synthesis differs from traditional machine learning. We then describe oracle-guided inductive synthesis (OGIS), a framework that captures a family of synthesizers that operate by iteratively querying an oracle. An instance of OGIS that has had much practical impact is counterexample-guided inductive synthesis (CEGIS). We present a theoretical characterization of CEGIS for learning any program that computes a recursive language. In particular, we analyze the relative power of CEGIS variants where the types of counterexamples generated by the oracle varies. We also consider the impact of bounded versus unbounded memory available to the learning algorithm. In the special case where the universe of candidate programs is finite, we relate the speed of convergence to the notion of teaching dimension studied in machine learning theory. Altogether, the results of the paper take a first step towards a theoretical foundation for the emerging field of formal inductive synthesis

SWATI: Synthesizing Wordlengths Automatically Using Testing and Induction

In this paper, we present an automated technique SWATI: Synthesizing Wordlengths Automatically Using Testing and Induction, which uses a combination of Nelder-Mead optimization based testing, and induction from examples to automatically synthesize optimal fixedpoint implementation of numerical routines. The design of numerical software is commonly done using floating-point arithmetic in design-environments such as Matlab. However, these designs are often implemented using fixed-point arithmetic for speed and efficiency reasons especially in embedded systems. The fixed-point implementation reduces implementation cost, provides better performance, and reduces power consumption. The conversion from floating-point designs to fixed-point code is subject to two opposing constraints: (i) the word-width of fixed-point types must be minimized, and (ii) the outputs of the fixed-point program must be accurate. In this paper, we propose a new solution to this problem. Our technique takes the floating-point program, specified accuracy and an implementation cost model and provides the fixed-point program with specified accuracy and optimal implementation cost. We demonstrate the effectiveness of our approach on a set of examples from the domain of automated control, robotics and digital signal processing

Effects of Disorder on Electron Transport in Arrays of Quantum Dots

We investigate the zero-temperature transport of electrons in a model of quantum dot arrays with a disordered background potential. One effect of the disorder is that conduction through the array is possible only for voltages across the array that exceed a critical voltage $V_T$. We investigate the behavior of arrays in three voltage regimes: below, at and above the critical voltage. For voltages less than $V_T$, we find that the features of the invasion of charge onto the array depend on whether the dots have uniform or varying capacitances. We compute the first conduction path at voltages just above $V_T$ using a transfer-matrix style algorithm. It can be used to elucidate the important energy and length scales. We find that the geometrical structure of the first conducting path is essentially unaffected by the addition of capacitive or tunneling resistance disorder. We also investigate the effects of this added disorder to transport further above the threshold. We use finite size scaling analysis to explore the nonlinear current-voltage relationship near $V_T$. The scaling of the current $I$ near $V_T$, $I\sim(V-V_T)^{\beta}$, gives similar values for the effective exponent $\beta$ for all varieties of tunneling and capacitive disorder, when the current is computed for voltages within a few percent of threshold. We do note that the value of $\beta$ near the transition is not converged at this distance from threshold and difficulties in obtaining its value in the $V\searrow V_T$ limit

Are There Good Mistakes? A Theoretical Analysis of CEGIS

Counterexample-guided inductive synthesis CEGIS is used to synthesize programs from a candidate space of programs. The technique is guaranteed to terminate and synthesize the correct program if the space of candidate programs is finite. But the technique may or may not terminate with the correct program if the candidate space of programs is infinite. In this paper, we perform a theoretical analysis of counterexample-guided inductive synthesis technique. We investigate whether the set of candidate spaces for which the correct program can be synthesized using CEGIS depends on the counterexamples used in inductive synthesis, that is, whether there are good mistakes which would increase the synthesis power. We investigate whether the use of minimal counterexamples instead of arbitrary counterexamples expands the set of candidate spaces of programs for which inductive synthesis can successfully synthesize a correct program. We consider two kinds of counterexamples: minimal counterexamples and history bounded counterexamples. The history bounded counterexample used in any iteration of CEGIS is bounded by the examples used in previous iterations of inductive synthesis. We examine the relative change in power of inductive synthesis in both cases. We show that the synthesis technique using minimal counterexamples MinCEGIS has the same synthesis power as CEGIS but the synthesis technique using history bounded counterexamples HCEGIS has different power than that of CEGIS, but none dominates the other.Comment: In Proceedings SYNT 2014, arXiv:1407.493

Healthcare Data Analytics on the Cloud

Meaningful analysis of voluminous health information has always been a challenge in most healthcare organizations. Accurate and timely information required by the management to lead a healthcare organization through the challenges found in the industry can be obtained using business intelligence (BI) or business analytics tools. However, these require large capital investments to implement and support the large volumes of data that needs to be analyzed to identify trends. They also require enormous processing power which places pressure on the business resources in addition to the dynamic changes in the digital technology. This paper evaluates the various nuances of business analytics of healthcare hosted on the cloud computing environment. The paper explores BI being offered as Software as a Service (SaaS) solution towards offering meaningful use of information for improving functions in healthcare enterprise. It also attempts to identify the challenges that healthcare enterprises face when making use of a BI SaaS solution

Carbothermic reduction of sulphide minerals

Imperial Users onl